A Variation on Hop-counting for Geographic Routing
نویسندگان
چکیده
In this paper, we propose a new abstraction for localization — Hop Coordinates — that can improve the accuracy of geographic routing over that possible with a localization algorithm based only on hop counting. As compared with previous proposed localization algorithms, which require additional hardware or special antennas, our technique is similar to hop counting and only requires the connectivity of network. Using simulations, we show that incorporating our technique improves the accuracy of geographic routing in localization results generated by MDS-MAP and MDS-MAP(P) by 22% and 14%, respectively.
منابع مشابه
Energy Efficiency and Reliability in Underwater Wireless Sensor Networks Using Cuckoo Optimizer Algorithm
Energy efficiency and reliability are widely understood to be one of the dominant considerations for Underwater Wireless Sensor Networks (UWSNs). In this paper, in order to maintain energy efficiency and reliability in a UWSN, Cuckoo Optimization Algorithm (COA) is adopted that is a combination of three techniques of geo-routing, multi-path routing, and Duty-Cycle mechanism. In the proposed alg...
متن کاملGeographic Routing with Low Stretch in d - dimensional Spaces ∗
Geographic routing is attractive because the routing state needed per node is independent of network size. We present a novel geographic routing protocol with several major advances over previous geographic protocols. First, our protocol achieves an average routing stretch close to 1. Second, our protocol can be used for nodes located in d-dimensional Euclidean spaces (d ≥ 2). Third, node locat...
متن کاملA Survey on Void Handling Techniques for Geographic Routing in VANET Network
Geographic routing exerts geographic information to select the next-hop along the route to the destination. Greedy forwarding is a geographic routing mechanism that uses geographical location information of nodes and the distance of each node to the destination, to select next-hop node that achieve the most positive movement to the destination. Where greedy forwarding is not possible, it can be...
متن کاملPerformance Analysis of Angular Geographic Distance Based Routing for Vehicular Ad Hoc Networks in Urban Environment
In vehicular ad hoc network, routing has become a critical issue in vehicle-to-vehicle communication. Therefore, there are several routing algorithms, which utilize topology information to make routing decisions at each node. We have proposed Angular GEographic DIstance-based Routing (A-GEDIR) protocol for packets transmission in high density urban area. In our protocol, a source node computes ...
متن کاملExploiting Local Knowledge to Enhance Energy-Efficient Geographic Routing
Geographic routing is one of the most widely-accepted techniques to route information in large-scale wireless sensor networks. It is based on a greedy forwarding strategy by which a sensor node selects as next hop relay the most promising neighbor (according to some metric) among those being closer to the destination than itself. This decision is based solely on the position of its neighbors an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006